skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Kutyniok, Gitta"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, SIAM Journal on Mathematics of Data Science)
    Free, publicly-accessible full text available June 30, 2026
  2. ; ; ; (, NeurIPS)
    Accepted Manuscript Full Text Available
  3. ; ; ; (, NeurIPS)
    Accepted Manuscript Full Text Available
  4. ; ; (, Applied and Computational Harmonic Analysis)
    Full Text Available 
  5. ; ; (, Advances in neural information processing systems)
    This work provides the first theoretical study on the ability of graph Message Passing Neural Networks (gMPNNs) -- such as Graph Neural Networks (GNNs) -- to perform inductive out-of-distribution (OOD) link prediction tasks, where deployment (test) graph sizes are larger than training graphs. We first prove non-asymptotic bounds showing that link predictors based on permutation-equivariant (structural) node embeddings obtained by gMPNNs can converge to a random guess as test graphs get larger. We then propose a theoretically-sound gMPNN that outputs structural pairwise (2-node) embeddings and prove non-asymptotic bounds showing that, as test graphs grow, these embeddings converge to embeddings of a continuous function that retains its ability to predict links OOD. Empirical results on random graphs show agreement with our theoretical results. 
    more » « less
    Accepted Manuscript Full Text Available
  6. ; ; ; (, NeurIPS)
    Accepted Manuscript Full Text Available
  7. ; ; ; ; (, European Conference on Computer Vision)
    Accepted Manuscript Full Text Available
  8. ; ; ; ; (, Journal of Mathematical Imaging and Vision)
    null (Ed.)
    Full Text Available